全文获取类型
收费全文 | 67541篇 |
免费 | 13272篇 |
国内免费 | 8982篇 |
专业分类
电工技术 | 8154篇 |
技术理论 | 1篇 |
综合类 | 8629篇 |
化学工业 | 1597篇 |
金属工艺 | 1259篇 |
机械仪表 | 5264篇 |
建筑科学 | 1274篇 |
矿业工程 | 932篇 |
能源动力 | 1495篇 |
轻工业 | 978篇 |
水利工程 | 1120篇 |
石油天然气 | 794篇 |
武器工业 | 1208篇 |
无线电 | 12047篇 |
一般工业技术 | 4180篇 |
冶金工业 | 534篇 |
原子能技术 | 354篇 |
自动化技术 | 39975篇 |
出版年
2024年 | 220篇 |
2023年 | 1166篇 |
2022年 | 2339篇 |
2021年 | 2521篇 |
2020年 | 2807篇 |
2019年 | 2381篇 |
2018年 | 2357篇 |
2017年 | 2760篇 |
2016年 | 3214篇 |
2015年 | 3829篇 |
2014年 | 4961篇 |
2013年 | 4839篇 |
2012年 | 5972篇 |
2011年 | 6205篇 |
2010年 | 5063篇 |
2009年 | 5188篇 |
2008年 | 5511篇 |
2007年 | 5915篇 |
2006年 | 4634篇 |
2005年 | 3817篇 |
2004年 | 3051篇 |
2003年 | 2415篇 |
2002年 | 1801篇 |
2001年 | 1384篇 |
2000年 | 1171篇 |
1999年 | 908篇 |
1998年 | 713篇 |
1997年 | 564篇 |
1996年 | 444篇 |
1995年 | 306篇 |
1994年 | 268篇 |
1993年 | 206篇 |
1992年 | 195篇 |
1991年 | 93篇 |
1990年 | 127篇 |
1989年 | 84篇 |
1988年 | 59篇 |
1987年 | 23篇 |
1986年 | 32篇 |
1985年 | 34篇 |
1984年 | 24篇 |
1983年 | 23篇 |
1982年 | 25篇 |
1981年 | 17篇 |
1980年 | 22篇 |
1979年 | 13篇 |
1978年 | 13篇 |
1977年 | 9篇 |
1975年 | 10篇 |
1959年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 109 毫秒
91.
Wireless sensor networks are generally composed of a large number of hardware devices of the same type, deployed over a region of interest in order to perform a monitoring activity on a set of target points. Nowadays, several different types of sensor devices exist, which are able to monitor different aspects of the region of interest (including sound, vibrations, proximity, chemical contaminants, among others) and may be deployed together in a heterogeneous network. In this work, we face the problem of maximizing the amount of time during which such a network can remain operational, while maintaining at all times a minimum coverage guarantee for all the different sensor types. Some global regularity conditions in order to guarantee a fair level of coverage for each sensor type to each target are also taken into account in a second variant of the proposed problem. For both problem variants we developed an exact approach, which is based on a column generation algorithm whose subproblem is either solved heuristically by means of a genetic algorithm or optimally by an appropriate ILP formulation. In our computational tests the proposed genetic algorithm is shown to be able to dramatically speed up the procedure, enabling the resolution of large-scale instances within reasonable computational times. 相似文献
92.
Optimization of tool path planning using metaheuristic algorithms such as ant colony systems (ACS) and particle swarm optimization (PSO) provides a feasible approach to reduce geometrical machining errors in 5-axis flank machining of ruled surfaces. The optimal solutions of these algorithms exhibit an unsatisfactory quality in a high-dimensional search space. In this study, various algorithms derived from the electromagnetism-like mechanism (EM) were applied. The test results of representative surfaces showed that all EM-based methods yield more effective optimal solutions than does PSO, despite a longer search time. A new EM-MSS (electromagnetism-like mechanism with move solution screening) algorithm produces the most favorable results by ensuring the continuous improvement of new searches. Incorporating an SPSA (simultaneous perturbation stochastic approximation) technique further improves the search results with effective initial solutions. This work enhances the practical values of tool path planning by providing a satisfactory machining quality. 相似文献
93.
This paper proposes the application of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in fixed structure H∞ loop shaping controller design. Integral Time Absolute Error (ITAE) performance requirement is incorporated as a constraint with an objective of maximization of stability margin in the fixed structure H∞ loop shaping controller design problem. Pneumatic servo system, separating tower process and F18 fighter aircraft system are considered as test systems. The CMA-ES designed fixed structure H∞ loop-shaping controller is compared with the traditional H∞ loop shaping controller, non-smooth optimization and Heuristic Kalman Algorithm (HKA) based fixed structure H∞ loop shaping controllers in terms of stability margin. 20% perturbation in the nominal plant is used to validate the robustness of the CMA-ES designed H∞ loop shaping controller. The effect of Finite Word Length (FWL) is considered to show the implementation difficulties of controller in digital processors. Simulation results demonstrated that CMA-ES based fixed structure H∞ loop shaping controller is suitable for real time implementation with good robust stability and performance. 相似文献
94.
This paper presents an adaptive backstepping-based multilevel approach for the first time to control nonlinear interconnected systems with unknown parameters. The system consists of a nonlinear controller at the first level to neutralize the interaction terms, and some adaptive controllers at the second level, in which the gains are optimally tuned using genetic algorithm. The presented scheme can be used in systems with strong couplings where completely ignoring the interactions leads to problems in performance or stability. In order to test the suitability of the method, two case studies are provided: the uncertain double and triple coupled inverted pendulums connected by springs with unknown parameters. The simulation results show that the method is capable of controlling the system effectively, in both regulation and tracking tasks. 相似文献
95.
本文讲述空调复杂空间曲面钣金件的设计思路及分析方法。主要从设计方法、模拟分析、零件测量比对等方面分析空间复杂曲面钣金件的设计思路,以满足结构使用要求、强度刚度以及经济要求。 相似文献
96.
Iterative improvement of parameter estimation for model migration by means of sequential experiments
Determining an optimal design for estimation of parameters of a class of complex models expected to be built at a minimum cost is a growing trend in science and engineering. We adopt a scale-bias adjustment migration strategy for integrating base and new models based on similar nature underlying processes. Further, we propose a Bayesian sequential algorithm for obtaining the statistically most informative data about the migrated model for use in parameter estimation. The benefits of the proposed strategy over traditional approaches presented in recent reported work are demonstrated using Monte Carlo simulations. 相似文献
97.
Efficient management of supply chain (SC) requires systematic considerations of miscellaneous issues in its comprehensive version. In this paper, a multi-periodic structure is developed for a supply chain network design (SCND) involving suppliers, factories, distribution centers (DCs), and retailers. The nature of the logistic decisions is tactical that encompasses procurement of raw materials from suppliers, production of finished product at factories, distribution of finished product to retailers via DCs, and the storage of raw materials and end product at factories and DCs. Besides, to make the structure more comprehensive, a flow-shop scheduling model in manufacturing part of the SC is integrated in order to obtain optimal delivery time of the product that consists of the makespan and the ship time of the product to DCs via factories. Moreover, to make the model more realistic, shortage in the form of backorder can occur in each period. The two objectives are minimizing the total SC costs as well as minimizing the average tardiness of product to DCs. The obtained model is a bi-objective mixed-integer non-linear programming (MINLP) model that is shown to belong to NP-Hard class of the optimization problems. Thus, a novel algorithm, called multi-objective biogeography based optimization (MOBBO) with tuned parameters is presented to find a near-optimum solution. As there is no benchmark available in the literature, the parameter-tuned multi-objective simulated annealing algorithm (MOSA) and the popular non-dominated sorting genetic algorithm (NSGA-II) are developed to validate the results obtained and to evaluate the performance of MOBBO using randomly generated test instances. 相似文献
98.
New efficient adaptive fast transversal filtering (FTF)‐type algorithms for mono and stereophonic acoustic echo cancelation 下载免费PDF全文
This paper addresses the field of stereophonic acoustic echo cancelation (SAEC) by adaptive filtering algorithms. Recently, simplified versions of the fast transversal filter (SFTF)‐type algorithm has been proposed. In this paper, we propose two major contributions. In the first contribution, we propose two new FTF‐type algorithms with low complexity and good convergence speed characteristics. These two proposed algorithms are mainly on the basis of a forward prediction scheme to estimate the so called dual Kalman gain, which is inherent in the filtering part update. This computation complexity is achieved by the introduction of new relations for the computation of the likelihood variables that are simple and lead to further simplifications on the prediction part of the two proposed algorithms. In the second contribution, we propose to adapt then apply these four new SFTF‐type algorithms, (the two proposed algorithms in this paper and their original versions) in the SAEC applications. A fair comparison of the proposed algorithms with the original SFTF and the normalized least mean square algorithms, in mono and SAEC applications, is presented. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
99.
Dynamic facility layout problem (DFLP) deals with the arrangement of machines in a site as to minimize the sum of materials handling and re-layout costs by considering multi periods. The DFLP studies in the literature provide several different algorithms and utilize the well known test problems to assess their performance. However, real life applications are overlooked. The industries such as footwear and clothing are prone to seasonal demand changes. Therefore, time horizons and layout/re-layout of the machines within the facility should be studied carefully. This study considers a footwear facility and several scenarios are generated by using the real life data. A clonal selection based algorithm is proposed to solve the real life DFLP. The performance of the algorithm, further the effect of time periods on solution quality and applicability of the results are tested and promising results are obtained. 相似文献
100.
The constrained estimation in Cox’s model for the right-censored survival data is studied and the asymptotic properties of the constrained estimators are derived by using the Lagrangian method based on Karush–Kuhn–Tucker conditions. A novel minorization–maximization (MM) algorithm is developed for calculating the maximum likelihood estimates of the regression coefficients subject to box or linear inequality restrictions in the proportional hazards model. The first M-step of the proposed MM algorithm is to construct a surrogate function with a diagonal Hessian matrix, which can be reached by utilizing the convexity of the exponential function and the negative logarithm function. The second M-step is to maximize the surrogate function with a diagonal Hessian matrix subject to box constraints, which is equivalent to separately maximizing several one-dimensional concave functions with a lower bound and an upper bound constraint, resulting in an explicit solution via a median function. The ascent property of the proposed MM algorithm under constraints is theoretically justified. Standard error estimation is also presented via a non-parametric bootstrap approach. Simulation studies are performed to compare the estimations with and without constraints. Two real data sets are used to illustrate the proposed methods. 相似文献